Counter Closure and Knowledge despite Falsehood

نویسندگان

  • Brian Ball
  • Gilbert Harman
چکیده

Certain puzzling cases have been discussed in the literature recently which appear to support the thought that knowledge can be obtained by way of deduction from a falsehood; moreover, these cases put pressure, prima facie, on the thesis of counter closure for knowledge. We argue that the cases do not involve knowledge from falsehood; despite appearances, the false beliefs in the cases in question are causally, and therefore epistemologically, incidental, and knowledge is achieved despite falsehood. We also show that the principle of counter closure, and the concomitant denial of knowledge from falsehood, is well motivated by considerations in epistemological theory—in particular, by the view that knowledge is first in the epistemological order of things.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$r$-fuzzy regular semi open sets in smooth topological spaces

In this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. By using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. Also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. Moreover, we investigate the ...

متن کامل

Closure, Counter-Closure, and Inferential Knowledge

The first thing to note about these principles is that (as I will be understanding them), they are not merely classificatory principles for demarcating/separating cases of knowledge from non-knowledge. As I will be understanding (and using) them, (C) and (CC) are intended to be featured in epistemological explanations of why some agent S knows that Q (as opposed, e.g., to merely truly believing...

متن کامل

Beyond Counter-Examples to Nonmonotonic Formalisms: A Possibility-Theoretic Analysis

In nonmonotonic reasoning, Lehmann's preferential System P is known to provide reasonable but very cautious conclusions, while the inference machinery may still remain too cautious or on the contrary provide counter-intuitive conclusions when using the rational closure inference. These two types of inference can be represented using a possibility theory-based semantics. Remedies to the above pr...

متن کامل

Coping with the Limitations of Rational Inference in the Framework of Possibility Theory

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does not provide expected results either because it cannot produce them, or even provide counter-intuitive conclusions. This state of facts is not due to the princ...

متن کامل

Computing Downward Closures for Stacked Counter Automata

The downward closure of a language L of words is the set of all (not necessarily contiguous) subwords of members of L. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a promising abstraction, there are only few language classes for which an automaton for the downward closure is known to be computable. It is shown here that for sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013